A path to computational efficiency through membrane computing

Membrane reactors: A way to increase efficiency

A Computational Complexity Theory in Membrane Computing

In this paper, a computational complexity theory within the framework of Membrane Computing is introduced. Polynomial complexity classes associated with different models of cell-like and tissue-like membrane systems are defined and the most relevant results obtained so far are presented. Many attractive characterizations of P 6= NP conjecture within the framework of a bio-inspired and non-conve...

Computational Efficiency of Optimized Shortest Path Algorithms

The main purpose of this study is to evaluate the computational efficiency of optimized shortest path algorithms. Our study establishes the relative order of the shortest path algorithms with respect to their known computational efficiencies is not significantly modified when the algorithms are adequately coded. An important contribution of this study is the inclusion of the re-distributive hea...

Computational Complexity Aspects in Membrane Computing

Within the framework of membrane systems, distributed parallel computing models inspired by the functioning of the living cell, various computational complexity classes have been defined, which can be compared against the computational complexity classes defined for Turing machines. Here some issues and results concerning computational complexity of membrane systems are discussed. In particular...

Computational Efficiency of Shortest Path Algorithms in C Language

The main purpose of this study is to evaluate the computational efficiency of algorithms for calculating shortest paths when they are correctly coded by using the C programming language. This paper thoroughly measures the benefit of using the C programming language for coding shortest path algorithms. For each algorithm, we suggest computer implementation that take full advantage of the pointer...